46 research outputs found
Superposition as memory: unlocking quantum automatic complexity
Imagine a lock with two states, "locked" and "unlocked", which may be
manipulated using two operations, called 0 and 1. Moreover, the only way to
(with certainty) unlock using four operations is to do them in the sequence
0011, i.e., where . In this scenario one might think that the
lock needs to be in certain further states after each operation, so that there
is some memory of what has been done so far. Here we show that this memory can
be entirely encoded in superpositions of the two basic states "locked" and
"unlocked", where, as dictated by quantum mechanics, the operations are given
by unitary matrices. Moreover, we show using the Jordan--Schur lemma that a
similar lock is not possible for .
We define the semi-classical quantum automatic complexity of a
word as the infimum in lexicographic order of those pairs of nonnegative
integers such that there is a subgroup of the projective unitary
group PU with and with such that, in terms of a
standard basis and with , we have
and for all with . We show that is
unbounded and not constant for strings of a given length. In particular, and
.Comment: Lecture Notes in Computer Science, UCNC (Unconventional Computation
and Natural Computation) 201
The Road to Quantum Computational Supremacy
We present an idiosyncratic view of the race for quantum computational
supremacy. Google's approach and IBM challenge are examined. An unexpected
side-effect of the race is the significant progress in designing fast classical
algorithms. Quantum supremacy, if achieved, won't make classical computing
obsolete.Comment: 15 pages, 1 figur
On Turing dynamical systems and the Atiyah problem
Main theorems of the article concern the problem of M. Atiyah on possible
values of l^2-Betti numbers. It is shown that all non-negative real numbers are
l^2-Betti numbers, and that "many" (for example all non-negative algebraic)
real numbers are l^2-Betti numbers of simply connected manifolds with respect
to a free cocompact action. Also an explicit example is constructed which leads
to a simply connected manifold with a transcendental l^2-Betti number with
respect to an action of the threefold direct product of the lamplighter group
Z/2 wr Z. The main new idea is embedding Turing machines into integral group
rings. The main tool developed generalizes known techniques of spectral
computations for certain random walk operators to arbitrary operators in
groupoid rings of discrete measured groupoids.Comment: 35 pages; essentially identical to the published versio
How much contextuality?
The amount of contextuality is quantified in terms of the probability of the
necessary violations of noncontextual assignments to counterfactual elements of
physical reality.Comment: 5 pages, 3 figure
Forecasting in the light of Big Data
Predicting the future state of a system has always been a natural motivation
for science and practical applications. Such a topic, beyond its obvious
technical and societal relevance, is also interesting from a conceptual point
of view. This owes to the fact that forecasting lends itself to two equally
radical, yet opposite methodologies. A reductionist one, based on the first
principles, and the naive inductivist one, based only on data. This latter view
has recently gained some attention in response to the availability of
unprecedented amounts of data and increasingly sophisticated algorithmic
analytic techniques. The purpose of this note is to assess critically the role
of big data in reshaping the key aspects of forecasting and in particular the
claim that bigger data leads to better predictions. Drawing on the
representative example of weather forecasts we argue that this is not generally
the case. We conclude by suggesting that a clever and context-dependent
compromise between modelling and quantitative analysis stands out as the best
forecasting strategy, as anticipated nearly a century ago by Richardson and von
Neumann
Quantum value indefiniteness
The indeterministic outcome of a measurement of an individual quantum is
certified by the impossibility of the simultaneous, definite, deterministic
pre-existence of all conceivable observables from physical conditions of that
quantum alone. We discuss possible interpretations and consequences for quantum
oracles.Comment: 19 pages, 2 tables, 2 figures; contribution to PC0
Symmetry structure in discrete models of biochemical systems : natural subsystems and the weak control hierarchy in a new model of computation driven by interactions
© 2015 The Authors. Published by the Royal Society under the terms of the Creative Commons Attribution License http://creativecommons.org/licenses/by/4.0/, which permits unrestricted use, provided the original author and source are credited.Interaction Computing (IC) is inspired by the observation that cell metabolic/regulatory systems construct order dynamically, through constrained interactions between their components and based on a wide range of possible inputs and environmental conditions. The goals of this work are (1) to identify and understand mathematically the natural subsystems and hierarchical relations in natural systems enabling this, and (2) to use the resulting insights to define a new model of computation based on interactions that is useful for both biology and computation. The dynamical characteristics of the cellular pathways studied in Systems Biology relate, mathematically, to the computational characteristics of automata derived from them, and their internal symmetry structures to computational power. Finite discrete automata models of biological systems such as the lac operon, Krebs cycle, and p53-mdm2 genetic regulation constructed from Systems Biology models have canonically associated algebraic structures { transformation semigroups. These contain permutation groups (local substructures exhibiting symmetry) that correspond to "pools of reversibility". These natural subsystems are related to one another in a hierarchical manner by the notion of "weak control ". We present natural subsystems arising from several biological examples and their weak control hierarchies in detail. Finite simple non-abelian groups (SNAGs) are found in biological examples and can be harnessed to realize nitary universal computation. This allows ensembles of cells to achieve any desired finitary computational transformation, depending on external inputs, via suitably constrained interactions. Based on this, interaction machines that grow and change their structure recursively are introduced and applied, providing a natural model of computation driven by interactions.Peer reviewe
A Survey on Continuous Time Computations
We provide an overview of theories of continuous time computation. These
theories allow us to understand both the hardness of questions related to
continuous time dynamical systems and the computational power of continuous
time analog models. We survey the existing models, summarizing results, and
point to relevant references in the literature